A multi-tier adaptive grid algorithm for the evolutionary multi-objective optimisation of complex problems

The multi-tier Covariance Matrix Adaptation Pareto Archived Evolution Strategy (m-CMA-PAES) is an evolutionary multi-objective optimisation (EMO) algorithm for real-valued optimisation problems. It combines a non-elitist adaptive grid based selection scheme with the efficient strategy parameter adaptation of the elitist Covariance Matrix Adaptation Evolution Strategy (CMA-ES). In the original CMA-PAES, a solution is selected as a parent for the next population using an elitist adaptive grid archiving (AGA) scheme derived from the Pareto Archived Evolution Strategy (PAES). In contrast, a multi-tiered AGA scheme to populate the archive using an adaptive grid for each level of non-dominated solutions in the considered candidate population is proposed. The new selection scheme improves the performance of the CMA-PAES as shown using benchmark functions from the ZDT, CEC09, and DTLZ test suite in a comparison against the (μ+λ) μ λ Multi-Objective Covariance Matrix Adaptation Evolution Strategy (MO-CMA-ES). In comparison with MO-CMA-ES, the experimental results show that the proposed algorithm offers up to a 69 % performance increase according to the Inverse Generational Distance (IGD) metric

A comprehensive review of swarm optimization algorithms

Many swarm optimization algorithms have been introduced since the early 60’s, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained, and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches

Using fast backpropagation algorithms for impulsive noise reduction from highly distorted images

A new Impulsive Noise elimination filter, which is based on fast backpropagation algorithms, is proposed in this paper. The simulation results show that the proposed filter achieves a superior performance over the other filters mentioned in this paper in the cases of being effective in noise suppression and detail preservation, especially when the noise density is high

Using Anfis with circular polygons for impulsive noise suppression from highly distorted images

In this paper, a novel approach is presented to the restoration of images corrupted by impulsive noise (IN), with a new nonlinear IN suppression filter, entitled circular polygons based adaptive-fuzzy filter (CF). The proposed filter is based on statistical impulse detection and nonlinear filtering which uses adaptive-network-based fuzzy inference system (Anfis) as a missed data interpolant over the circular polygons and provides estimates for the original intensity values of corrupted pixels. Impulse detection is realized by using the chi-square based goodness-of-fit test, which yields a decision about the impulsivity of each pixel. Extensive simulations were realized to demonstrate the capability of CF and they reveal that the proposed filter achieves a better performance than the other filters mentioned in this paper in the cases of being effective in noise suppression and detail preservation, also when the images are highly corrupted by IN. (c) 2004 Elsevier GmbH. All rights reserved

Using an adaptive neuro-fuzzy inference system-based interpolant for impulsive noise suppression from highly distorted images

A new impulsive noise (IN) suppression filter, entitled Adaptive neuro-fuzzy inference system (ANFIS)-based impulsive noise suppression Filter, which shows a high performance at the restoration of images distorted by IN, is proposed in this paper. The extensive simulation results show that the proposed filter achieves a superior performance to the other filters mentioned in this paper in the cases of being effective in noise suppression and detail preservation, especially when the noise density is very high. (C) 2004 Elsevier B.V. All rights reserved

DIFFERENTIAL SEARCH ALGORITHM BASED EDGE DETECTION

In this paper, a new method has been presented for the extraction of edge information by using Differential Search Optimization Algorithm. The proposed method is based on using a new heuristic image thresholding method for edge detection. The success of the proposed method has been examined on fusion of two remote sensed images. The applicability of the proposed method on edge detection and image fusion problems have been analysed in detail and the empirical results exposed that the proposed method is useful for solving the mentioned problems

A New Unsupervised Change Detection Approach Based On DWT Image Fusion And Backtracking Search Optimization Algorithm For Optical Remote Sensing Data

Change detection is one of the most important subjects of remote sensing discipline. In this paper, a new unsupervised change detection approach is proposed for multi-temporal remotely sensed optic imagery. This approach does not require any prior information about changed and unchanged pixels. The approach is based on Discrete Wavelet Transform (DWT) based image fusion and Backtracking Search Optimization Algorithm (BSA). In the first step of the approach, absolute-valued difference image and absolute-valued log-ratio image is calculated from co-registered and radiometrically corrected multi-temporal images. Then, these difference images are fused using DWT. The fused image is filtered by median filter for edge information preservation and by wiener filter for image smoothing. Then, a min-max normalization is applied to the filtered data. The normalized data is clustered into two groups with BSA as changed and unchanged pixels by minimizing an objective function, unlike classical methods using CVA, PCA, FCM or K-means techniques. To show effectiveness of proposed approach, two remote sensing data sets, Sardinia and Mexico, are used. False Alarm, Missed Alarm, Total Alarm and Total Error Rate are selected as performance criteria to evaluate the effectiveness of new approach using ground truth images. Experimental results show that proposed approach is effective for unsupervised change detection of optical remote sensing data

Performance Comparison Of Evolutionary Algorithms For Image Clustering

Evolutionary computation tools are able to process real valued numerical sets in order to extract suboptimal solution of designed problem. Data clustering algorithms have been intensively used for image segmentation in remote sensing applications. Despite of wide usage of evolutionary algorithms on data clustering, their clustering performances have been scarcely studied by using clustering validation indexes. In this paper, the recently proposed evolutionary algorithms (i.e., Artificial Bee Colony Algorithm (ABC), Gravitational Search Algorithm (GSA), Cuckoo Search Algorithm (CS), Adaptive Differential Evolution Algorithm (JADE), Differential Search Algorithm (DSA) and Backtracking Search Optimization Algorithm (BSA)) and some classical image clustering techniques (i.e., k-means, fcm, som networks) have been used to cluster images and their performances have been compared by using four clustering validation indexes. Experimental test results exposed that evolutionary algorithms give more reliable cluster-centers than classical clustering techniques, but their convergence time is quite long